package com.leetcode.merci.lc371;

/**
 * Created by bowen on 2017/7/29.
 */
public class Solution {
    public int getSum(int a, int b) {
        int m = a^b;
        int n = a&b<<1;
        while(n==0){
            m=m^n;
            n=m&n<<1;
        }
        return m;
    }
}
